CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Source URL: 2011.cccg.ca

• Mathematics
• Dominating set
• Unit disk graph
• Independent set
• APX
• Approximation algorithm
• Vertex cover
• Planar separator theorem
• Theoretical computer science
• Graph theory
• NP-complete problems

Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro

Source URL: www.mrfellows.net

• NP-complete problems
• Parameterized complexity
• Kernelization
• Vertex cover
• Graph coloring
• Minimum k-cut
• Algorithm
• Independent set
• Greedy algorithm
• Theoretical computer science
• Mathematics
• Computational complexity theory

LNCSEvaluating Query-Independent Object Features for Relevancy Prediction

Source URL: www.dcs.gla.ac.uk

• Bayesian statistics
• Statistical classification
• Machine learning
• Natural language processing
• Relevance feedback
• Naive Bayes classifier
• Supervised learning
• Feature selection
• Training set
• Statistics
• Information science
• Information retrieval

Chapter 7 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In di

Source URL: dcg.ethz.ch

• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Matching
• Randomized algorithm
• Graph coloring
• Connectivity
• Graph
• A* search algorithm
• Mathematics
• Theoretical computer science
• Graph theory

Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§

Source URL: www.dim.uchile.cl

• NP-complete problems
• Vertex cover
• Feedback vertex set
• Independent set
• Matching
• Maximal independent set
• Parameterized complexity
• Algorithm
• Dominating set
• Theoretical computer science
• Mathematics
• Computational complexity theory

Evaluating query-independent object features for relevancy prediction? Andres R. Masegosa† , Hideo Joho‡ , and Joemon M. Jose‡ † , {hideo,jj}@dcs.gla.ac.uk

Source URL: www.dcs.gla.ac.uk

• Machine learning
• Natural language processing
• Information retrieval
• Naive Bayes classifier
• Supervised learning
• Feature selection
• Relevance feedback
• Averaged one-dependence estimators
• Training set
• Statistics
• Statistical classification
• Bayesian statistics

CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

Source URL: cccg.ca

• NP-complete problems
• Graph coloring
• Domatic number
• Dominating set
• Independent set
• Greedy coloring
• Topology
• Maximal independent set
• Graph
• Graph theory
• Theoretical computer science
• Mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli†

Source URL: www.cccg.ca

• NP-complete problems
• Hamiltonian path
• Vertex cover
• Independent set
• Matching
• Minimum spanning tree
• Dominating set
• Graph coloring
• Theoretical computer science
• Graph theory
• Mathematics

Coaching Advisory Panel – Terms of Reference The Coaching Advisory Panel (CAP) is authorised by the INF Board of Directors to conduct its business in accordance with the Terms of Reference as set out below. The Board o

Source URL: www.netball.org

Central and local government will work in partnership with the sector to ensure a smooth transition towards this new role and to implement the recommendations set out in the independent review on the future of the sector

Source URL: www.housing.ie

• Affordable housing
• Community organizing
• Public housing
• Property
• Home
• Housing cooperative
• Private rented sector
• Workforce housing
• Mixed-income housing
• Real estate
• Housing
• Social programs